Expansion trees with cut

Expansion Trees with Cut

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first-and higher-order logic by recording the information which instances have been chosen for which quantifiers, known in the literature as expansion trees. Such a representation is inherently analytic and hence corresponds to a cut-f...

Dynamic-Cut with Definitional Trees

The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was...

Analytic Cut Trees

Smullyan maintains that the importance of cut-free proofs does not stem from cut elimination per se but rather from the fact that they satisfy the subformula property. In accordance with such a viewpoint in this paper we introduce analytic cut trees, a system from which cuts cannot be eliminated but satisfying the subformula property. Like tableaux analytic cut trees are a refutation system but...

Forecasting of Cut Christmas Trees with Artificial Neural Networks (ANN)

The establishment of Christmas tree plantations over the last 50 years in Greece has provided an additional income for the inhabitants of certain mountainous and semi-mountainous regions of the country and contributed to their development. In this paper is used a neural network which combined with ARIMA which makes forecast of number of actually cut Christmas trees until the year 2015.

A Crude Cut at Query Expansion